Computational algebraic geometry

ثبت نشده
چکیده

Algebraic geometry is a powerful combination of algebra and geometry, with a rich history and many applications, both theoretical and practical. It also has an intimidating reputation. Hence it is important to have a variety of introductory texts at different levels of sophistication. We will see that Schenck's book offers an interesting path into this wonderful subject. 1. What is algebraic geometry? Algebraic geometry goes back to the coordinate geometry of Descartes, which enables one to describe curves and surfaces by means of equations. When the equations involve only polynomials, then the algebra of the polynomials is deeply linked to the geometry of the corresponding curves and surfaces. But there is more to algebraic geometry than just equations and solutions, for the solutions often exhibit " extra structure ". Consider what happens when a line meets the circle x 2 + y 2 = 2: y = x y = x − 2 A B C The picture on the left has two points of intersection A and B, while on the right we have the single point of intersection C. However, since the line is tangent to the circle at this point, we say that C has multiplicity two. Multiplicity can be defined rigorously in various ways. At the point C, we can proceed as follows. Let R[x, y] C = f g f, g ∈ R[x, y], g(C) = 0 be the ring of rational functions in x, y that are defined at C. Inside this ring we have the ideal x 2 + y 2 − 2, y − x + 2 generated by x 2 + y 2 − 2 and y − x + 2. Then one can show that the quotient ring O C = R[x, y] C /x 2 + y 2 − 2, y − x + 2

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational geometry and combinatorial algorithms for the genus computation problem ∗

Computational geometry and combinatorial algorithms play an important role in algebraic geometry. We report on several computational geometry and combinatorial algorithms needed for computing the genus of a plane complex algebraic curve with numeric coefficients.

متن کامل

Conference on Algebraic Topological Methods in Computer Science

The recognition that within the area of computational geometry, the methods of algebraic topology can provide qualitative and shape information which isn't available from other methods. Algebraic topology provides a tool for visualization and feature identification in high dimensional data. Algebraic topology is an extremely useful framework for analyzing problems in distributed computing, such...

متن کامل

38 COMPUTATIONAL and QUANTITATIVE REAL ALGEBRAIC GEOMETRY

Computational and quantitative real algebraic geometry studies various algorithmic and quantitative questions dealing with the real solutions of a system of equalities, inequalities, and inequations of polynomials over the real numbers. This emerging field is largely motivated by the power and elegance with which it solves a broad and general class of problems arising in robotics, vision, compu...

متن کامل

37 Computational and Quantitative Real Algebraic Geometry

Computational and quantitative real algebraic geometry studies various algorithmic and quantitative questions dealing with the real solutions of a system of equalities, inequalities, and inequations of polynomials over the real numbers. This emerging field is largely motivated by the power and elegance with which it solves a broad and general class of problems arising in robotics, vision, compu...

متن کامل

Affine and Projective Universal Geometry

By recasting metrical geometry in a purely algebraic setting, both Euclidean and non-Euclidean geometries can be studied over a general field with an arbitrary quadratic form. Both an affine and a projective version of this new theory are introduced here, and the main formulas extend those of rational trigonometry in the plane. This gives a unified, computational model of both spherical and hyp...

متن کامل

Computation of Peirod Matrices of Real Algebraic Curves

In this paper we derive a numerical method which allows us to compute periods of diierentials on a real algebraic curve with real points. This leads to an algorithm which can be implemented on a computer and can be used to study the Torelli mapping numerically.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004